Software Complexity for Computer Communication and Sensor Networks Using Binary Decision Diagrams
نویسندگان
چکیده
-Software complexity has been a topic of interest for software engineers for the last three decades. Various definitions of software complexity have appeared in literature from time to time. This has resulted in the development of software metrics by different investigators. With the new developments in the area of computer communication and sensor networks, software complexity metrics need an improvement so that they can be used for internet, computer communication networks, and sensor networks. It is difficult to apply the existing definitions of software complexity to internet applications. The objective of the present paper is to propose a definition which could be used for internet and sensor networks applications. In this paper a new definition of software complexity is utilized for the proposed applications. It is suggested to use Binary Decision Diagrams for this purpose as these diagrams result in disjoint expression which is needed in the calculation of the software complexity. Simple cases of software complexity for series, parallel, series-parallel and non series-parallel networks are investigated. The simulation of the proposed algorithm is given in this paper. The complexity between two nodes of a graph can be determined with the help of path expressions between the two nodes of interest of a graph. Binary Decision Diagram approach is then utilized to determine the complexity between two terminal nodes of a graph. The approach is applicable to any number of nodes and branches of a graph. It is hoped that this approach will be extensively used by software engineers who are developing software for internet, computer communication networks, and sensor networks. Harpreet Singh, [email protected], Adam Mustapha, [email protected] Arati M Dixit, [email protected] Department of Electrical and Computer Engineering, Wayne State University Detroit, MI 48202 Kuldip Singh with Department of Electrical and Computer Engineering, IIT Roorkee, India, 247667 Grant R. Gerhart, [email protected], U.S. Army Tank Automotive Command Research, Development and Engineering Center, Warren, MI 48088
منابع مشابه
A novel key management scheme for heterogeneous sensor networks based on the position of nodes
Wireless sensor networks (WSNs) have many applications in the areas of commercial, military and environmental requirements. Regarding the deployment of low cost sensor nodes with restricted energy resources, these networks face a lot of security challenges. A basic approach for preparing a secure wireless communication in WSNs, is to propose an efficient cryptographic key management protocol be...
متن کاملSink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملA Priority-based Routing Algorithm for Underwater Wireless Sensor Networks (UWSNs)
Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...
متن کاملOutlier Detection in Wireless Sensor Networks Using Distributed Principal Component Analysis
Detecting anomalies is an important challenge for intrusion detection and fault diagnosis in wireless sensor networks (WSNs). To address the problem of outlier detection in wireless sensor networks, in this paper we present a PCA-based centralized approach and a DPCA-based distributed energy-efficient approach for detecting outliers in sensed data in a WSN. The outliers in sensed data can be ca...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کامل